Gaussian moments for noisy complexity pursuit
نویسندگان
چکیده
Complexity pursuit is an extension of projection pursuit to time series data and the method is closely related to blind separation of time-dependent source signals and independent component analysis (ICA). In this paper, we consider the estimation of the data model of ICA when Gaussian noise is present and the independent components are time dependent. We derive a simple algorithm combining Gaussian moments and complexity pursuit for noisy ICA. Validity and performance of the described approaches are demonstrated by computer simulations. r 2005 Elsevier B.V. All rights reserved.
منابع مشابه
Fast ICA for noisy data using Gaussian moments
A novel approach for the problem of estimating the data model of independent component analysis (or blind source separation) in the presence of gaussian noise is introduced. We de ne the gaussian moments of a random variable as the expectations of the gaussian function (and some related functions) with di erent scale parameters, and show how the gaussian moments of a random variable can be esti...
متن کاملRobust reconstruction algorithm for compressed sensing in Gaussian noise environment using orthogonal matching pursuit with partially known support and random subsampling
The compressed signal in compressed sensing (CS) may be corrupted by noise during transmission. The effect of Gaussian noise can be reduced by averaging, hence a robust reconstruction method using compressed signal ensemble from one compressed signal is proposed. The compressed signal is subsampled for L times to create the ensemble of L compressed signals. Orthogonal matching pursuit with part...
متن کاملDelay and Doppler Estimation of Gaussian Mixtures Using Moment
In this paper, a new moment-based method for joint time delay and Doppler estimation in passive radar, sonar, and GPS applications is described. We provide a new blind approach for estimating the delay and Doppler imposed onto a Gaussian mixture using on the statistical moments. Wigner-Ville (WV) distribution has suitable estimation for delay and Doppler. However, since WV is a bilinear transfo...
متن کاملNoisy images edge detection: Ant colony optimization algorithm
The edges of an image define the image boundary. When the image is noisy, it does not become easy to identify the edges. Therefore, a method requests to be developed that can identify edges clearly in a noisy image. Many methods have been proposed earlier using filters, transforms and wavelets with Ant colony optimization (ACO) that detect edges. We here used ACO for edge detection of noisy ima...
متن کاملDesign of Gaussian mixture models using matching pursuit
In this paper, a new design algorithm for estimating the parameters of Gaussian Mixture Models is presented. The method is based on the matching pursuit algorithm. Speaker Identification is considered as an application area. The estimated GMM performs as good as the EM algorithm based model. Computational complexity of the proposed method is much lower than the EM algorithm.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Neurocomputing
دوره 69 شماره
صفحات -
تاریخ انتشار 2006